Eigenvalue bounds for saddle-point systems with singular leading blocks
نویسندگان
چکیده
We derive bounds on the eigenvalues of saddle-point matrices with singular leading blocks. The technique proof is based augmenting block to replace it a positive definite matrix. Our depend principal angles between ranges or kernels matrix Numerical experiments validate our analytical findings.
منابع مشابه
Spectral Analysis of Saddle Point Matrices with Indefinite Leading Blocks
After a brief introduction to the spectral analysis of saddle point matrices, in this talk we present new estimates for the eigenvalue intervals for symmetric saddle-point and regularised saddle-point matrices in the case where the (1,1) block may be indefinite. These generalise known results for the definite (1,1) case. We also discuss spectral properties of the equivalent augmented formulatio...
متن کاملNew Block Triangular Preconditioners for Saddle Point Linear Systems with Highly Singular (1,1) Blocks
We establish two types of block triangular preconditioners applied to the linear saddle point problems with the singular 1,1 block. These preconditioners are based on the results presented in the paper of Rees and Greif 2007 . We study the spectral characteristics of the preconditioners and show that all eigenvalues of the preconditioned matrices are strongly clustered. The choice of the parame...
متن کاملOn the Moore-Penrose inverse in solving saddle-point systems with singular diagonal blocks
The paper deals with the role of the generalized inverses in solving saddle-point systems arising naturally in the solution of many scientific and engineering problems when FETI based domain decomposition methods are used to their numerical solution. It is shown that the Moore-Penrose inverse may be obtained in this case at negligible cost by projecting an arbitrary generalized inverse using or...
متن کاملEigenvalue Estimates for Preconditioned Saddle Point Matrices
New eigenvalue bounds for symmetric matrices of saddle point form are derived and applied for preconditioned versions of the matrices. The preconditioners enable efficient iterative solution of the corresponding linear systems with, for some important applications, an optimal order of computational complexity.
متن کاملA New Preconditioner with Two Variable Relaxation Parameters for Saddle Point Linear Systems with Highly Singular(1,1) Blocks
In this paper, we provide new preconditioner for saddle point linear systems with (1,1) blocks that have a high nullity. The preconditioner is block triangular diagonal with two variable relaxation paremeters and it is extension of results in [1] and [2]. Theoretical analysis shows that all eigenvalues of preconditioned matrix is strongly clustered. Finally, numerical tests confirm our analysis.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2023
ISSN: ['0377-0427', '1879-1778', '0771-050X']
DOI: https://doi.org/10.1016/j.cam.2022.114996